Joint Source-Channel Decoding of Variable-Length Codes with Soft Information: A Survey
نویسندگان
چکیده
Multimedia transmission over time-varying wireless channels presents a number of challenges beyond existing capabilities conceived so far for third-generation networks. Efficient quality-of-service (QoS) provisioning for multimedia on these channels may in particular require a loosening and a rethinking of the layer separation principle. In that context, joint source-channel decoding (JSCD) strategies have gained attention as viable alternatives to separate decoding of source and channel codes. A statistical framework based on hidden Markov models (HMMs) capturing dependencies between the source and channel coding components sets the foundation for optimal design of techniques of joint decoding of source and channel codes. The problem has been largely addressed in the research community, by considering both fixed-length codes (FLC) and variable-length source codes (VLC) widely used in compression standards. Joint source-channel decoding of VLC raises specific difficulties due to the fact that the segmentation of the received bitstream into source symbols is random. This paper makes a survey of recent theoretical and practical advances in the area of JSCD with soft information of VLC-encoded sources. It first describes the main paths followed for designing efficient estimators for VLC-encoded sources, the key component of the JSCD iterative structure. It then presents the main issues involved in the application of the turbo principle to JSCD of VLC-encoded sources as well as the main approaches to source-controlled channel decoding. This survey terminates by performance illustrations with real image and video decoding systems.
منابع مشابه
. Soft source decoding with applications
Motivated by recent results in joint source-channel coding and decoding, we consider the problem of decoding of variable-length codes using soft channel values. We present results of decoding of selected codes using the maximum a posteriori (MAP) decoder and the sequential decoder, and show the performance gains over decoding using hard decisions alone. The objective behind this work is to prov...
متن کاملReduced complexity maximum a posteriori decoding of variable-length codes
Until very recently, joint source channel techniques mostly focused on systems using fixed-length coding, eventhough variable-length coding (VLC) is widely used, particularly in video coding. Typically, VLC bit streams are made channel-robust through packetization and standard forward-error correction (FEC). However, when the channel conditions are fairly mild, FEC can reveal itself bandwidth-i...
متن کاملSource and joint source-channel decoding of variable length codes
Several recent publications have shown that joint sourcechannel decoding (JSCD) could be a powerful technique for taking advantage of residual source redundancy. Furthermore, it appeared that the principle could also be successfully applied to variable length codes (VLCs). This paper gives an in-depth analysis of a new method recently proposed in [1], [2] to provide a low complexity soft decodi...
متن کاملOn Variable Length Codes for Iterative Source/Channel Decoding
We focus on a trellis-based decoding technique for variable length codes (VLCs) which does not require any additional side information besides the number of bits in the coded sequence. A bit-level soft-in/soft-out decoder based on this trellis is used as an outer component decoder in an iterative decoding scheme for a serially concatenated source/channel coding system. In contrast to previous a...
متن کاملOn Iterative Source-channel Decoding for Variable-length Encoded Markov Sources Using a Bit-level Trellis
In this paper we present a novel bit-level soft-input / softoutput decoding algorithm for variable-length encoded packetized Markov sources transmitted over wireless channels. An interesting feature of the proposed approach is that symbol-based source statistics in form of transition probabilities of the Markov source are exploited as a-priori information on a bit-level trellis. When additional...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- EURASIP J. Adv. Sig. Proc.
دوره 2005 شماره
صفحات -
تاریخ انتشار 2005